Floating Point Unit Generation and Evaluation for FPGAs

نویسندگان

  • Jian Liang
  • Russell Tessier
  • Oskar Mencer
چکیده

Floating point units form an important component of many reconfigurable computing applications. The creation of floating point units under a collection of area, latency, and throughput constraints is an important consideration for system designers. Given the range of possible tradeoffs, most commercial or academic floating point libraries for FPGAs provide a small fraction of possible floating point units. In contrast, the floating unit generation approach outlined in this paper allows for the creation of more than 200 different floating point units, with differing area, throughput, and latency characteristics. These variations are supported through selection of a floating point architecture and the use of floating point unit pipelining. Each of these floating point units can be generated with a variable number of bits for the mantissa and the exponent. Given requirements on throughput, area and latency, our generation flow automatically chooses the proper algorithm and architecture to create a floating point unit which fulfills design requirements. Our approach is fully integrated into standard C++ using ASC, a stream compiler for FPGAs, and the underlying PAM-Blox II module generation environment [13]. The floating point units created by our approach are competitive in size and performance with ones created by commercial vendors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Independent Evaluation of Floating-point DSP Energy Efficiency on Altera 28 nm FPGAs

OVERVIEW FPGAs are increasingly used as parallel processing engines for demanding digital signal processing (DSP) applications. Benchmark results show that on highly parallelizable workloads, FPGAs can achieve higher performance and superior cost/performance compared to digital signal processors and general-purpose CPUs. However, higher performance often comes with higher power consumption and ...

متن کامل

FPGA Optimizations for a Pipelined Floating-Point Exponential Unit

The large number of available DSP slices on new-generation FPGAs allows for efficient mapping and acceleration of floating-point intensive codes. Numerous scientific codes heavily rely on executing the exponential function. To this end, we present the design and implementation of a pipelined CORDIC/TD-based (COrdinate Rotation DIgital Computer/Table Driven) Exponential Approximation Unit (EAU) ...

متن کامل

Development of a Scalable FPGA-Based Floating Point Multiplier Summary

This paper presents the implementation of a general purpose, scalable architecture used to synthesize floating point multipliers on FPGAs. Although several implementations of floating point units targeted to FPGAs have been previously reported, most of them are customized for specific applications. This new implementation is different in the sense that it accepts as a user parameter the operand...

متن کامل

Parameterized floating-point logarithm and exponential functions for FPGAs

As FPGAs are increasingly being used for floating-point computing, the feasibility of a library of floating-point elementary functions for FPGAs is discussed. An initial implementation of such a library contains parameterized operators for the logarithm and exponential functions. In single precision, those operators use a small fraction of the FPGA’s resources, have a smaller latency than their...

متن کامل

Accelerating Double Precision Floating-point Hessenberg Reduction on FPGA and Multicore Architectures

Double precision floating-point performance is critical for hardware acceleration technologies to be adopted by domain scientists. In this work we use the Hessenberg reduction to demonstrate the potential of FPGAs and GPUs for obtaining satisfactory double precision floating-point performance. Currently a Xeon (Nehalem) 2.26 GHz CPU can outperform Xilinx Virtex4LX200 by 3.6 folds. However, give...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003